Local structure information by EXAFS analysis using two algorithms for Fourier transform calculation
نویسندگان
چکیده
منابع مشابه
calculation of computational complexity for radix-2p fast fourier transform algorithms for medical signals
due to its simplicity radix-2 is a popular algorithm to implement fast fourier transform. radix - 2 p algorithms have the same order of computational complexity as higher radices algorithms, but still retain the simplicity of radix-2 . by defining a new concept, twiddle factor template , in this paper we propose a method for exact calculation of multiplicative complexity for radix-2 p algorithm...
متن کاملFractional-Fourier-transform calculation through the fast-Fourier-transform algorithm.
A method for the calculation of the fractional Fourier transform (FRT) by means of the fast Fourier transform (FFT) algorithm is presented. The process involves mainly two FFT's in cascade; thus the process has the same complexity as this algorithm. The method is valid for fractional orders varying from -1 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT...
متن کاملDrifting sub-pulse analysis using the two-dimensional Fourier transform
The basic form of drifting sub-pulses is that of a periodicity whose phase depends (approximately linearly) on both pulse longitude and pulse number. As such, we argue that the two-dimensional Fourier transform of the longitude-time data (called the Two-Dimensional Fluctuation Spectrum; 2DFS) presents an ideal basis for studies of this phenomenon. We examine the 2DFS of a pulsar signal synthesi...
متن کاملNonuniform sampled scalar diffraction calculation using nonuniform fast Fourier transform.
Scalar diffraction calculations, such as the angular spectrum method (ASM) and Fresnel diffraction, are widely used in the research fields of optics, x rays, electron beams, and ultrasonics. It is possible to accelerate the calculation using fast Fourier transform (FFT); unfortunately, acceleration of the calculation of nonuniform sampled planes is limited due to the property of the FFT that im...
متن کاملCalculation of Computational Complexity for Radix-2p Fast Fourier Transform Algorithms for Medical Signals
Owing to its simplicity radix-2 is a popular algorithm to implement fast fourier transform. Radix-2(p) algorithms have the same order of computational complexity as higher radices algorithms, but still retain the simplicity of radix-2. By defining a new concept, twiddle factor template, in this paper, we propose a method for exact calculation of multiplicative complexity for radix-2(p) algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2009
ISSN: 1742-6596
DOI: 10.1088/1742-6596/182/1/012056